Majorization framework for balanced lattice designs
نویسندگان
چکیده
منابع مشابه
Majorization framework for balancedlattice designs
This paper aims to generalize and unify classical criteria for comparisons of balanced lattice designs, including fractional factorial designs, supersaturated designs and uniform designs. We present a general majorization framework for assessing designs, which includes a stringent criterion of majorization via pairwise coincidences and flexible surrogates via convex functions. Classical orthogo...
متن کاملBalanced Words and majorization
Write |w| = m, the length of w, and |w|1 = card({1 ≤ i ≤ m : wi = 1}) its 1-length. Define the cyclic shift σ : {0, 1}m → {0, 1}m by σ(w1 . . . wm) = w2 . . . wmw1. A cyclic subword of w is any length-q prefix of some σi−1(w), 1 ≤ i, q ≤ m. To any word w = w1 . . . wm we associate its orbit O(w), the vector O(w) = (O1(w), . . . ,Om(w)) consisting of the iterated cyclic shifts w, σ(w), . . . , σ...
متن کاملConstruction of variety competition cyclic balanced designs on square lattice
A class of cyclic balanced designs with ten test-hills is introduced; these designs can be repeated cyclically any number of times up to the requirement of the experimenter and subject to the availability of experimental material. The designs are balanced with respect to first order nearest neighbours and there are 26 isomorphism classes of such designs. The designs are suitable for de Wit repl...
متن کاملBalanced Nested Designs and Balanced n-ary Designs
We introduce here two types of balanced nested designs (BND), which are called symmetric and pair-sum BNDs. In this paper, we give a construction for pair-sum BNDs of BIBDs from nested BIBDs and perpendicular arrays. We also give some direct constructions for pair-sum BNDs of BIBDs, based on the result obtained by Wilson (1972). By use of these constructions, we show some constructions for regu...
متن کاملThe Concept of Majorization in Experimental Designs
The information of interest is contained in the variance matrix, σ − = 2 1 V Q , or equivalently in the information matrix Q . The problem of finding estimators minimizing a decreasing convex functional of the variance matrix or maximizing an increasing concave functional of the information matrix is crucial in statistics. There are several optimality criteria in bibliography. We explain how th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Annals of Statistics
سال: 2005
ISSN: 0090-5364
DOI: 10.1214/009053605000000679